TSTP Solution File: SEV446^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV446^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:13 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 232 ( 69 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 340 ( 41 ~; 43 |; 8 &; 242 @)
% ( 4 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 63 ( 0 ^ 50 !; 9 ?; 63 :)
% ( 4 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INSERT':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/EMPTY':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_6,type,
sK1: sK0 ).
thf(func_def_7,type,
sK2: sK0 ).
thf(func_def_9,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f43,plain,
$false,
inference(avatar_sat_refutation,[],[f33,f34,f37,f42]) ).
thf(f42,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f41]) ).
thf(f41,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f40,f20]) ).
thf(f20,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: $tType,X1: X0] :
~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0] :
~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
file('/export/starexec/sandbox/tmp/tmp.5NjRl2ZS1e/Vampire---4.8_23430','thm/sets/NOT_IN_EMPTY_') ).
thf(f40,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/EMPTY' @ sK0 )
= $true )
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f39,f31]) ).
thf(f31,plain,
( ( sK2 != sK1 )
| spl3_2 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl3_2
<=> ( sK2 = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f39,plain,
( ( sK2 = sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/EMPTY' @ sK0 )
= $true )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ( sK2 = sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/EMPTY' @ sK0 )
= $true )
| ~ spl3_1 ),
inference(superposition,[],[f23,f28]) ).
thf(f28,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f26,plain,
( spl3_1
<=> ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f23,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
!= $true )
| ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
!= $true ) )
& ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
= $true )
| ( ( X1 != X2 )
& ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
!= $true ) ) ) ),
inference(flattening,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
!= $true ) )
& ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
= $true )
| ( ( X1 != X2 )
& ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= $true ) )
<=> ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( X1 = X2 )
| ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5NjRl2ZS1e/Vampire---4.8_23430','thm/sets/IN_INSERT_') ).
thf(f37,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f36]) ).
thf(f36,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f35,f24]) ).
thf(f24,plain,
! [X0: $tType,X2: X0,X3: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
= $true ),
inference(equality_resolution,[],[f22]) ).
thf(f22,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ X3 ) )
= $true )
| ( X1 != X2 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f35,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK1 @ 'const/sets/EMPTY' @ sK0 ) )
!= $true )
| spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f27,f32]) ).
thf(f32,plain,
( ( sK2 = sK1 )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f27,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
!= $true )
| spl3_1 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f34,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f19,f30,f26]) ).
thf(f19,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
!= $true )
| ( sK2 != sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
!= $true )
| ( sK2 != sK1 ) )
& ( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
= $true )
| ( sK2 = sK1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14]) ).
thf(f14,plain,
( ? [X0: $tType,X1: X0,X2: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
!= $true )
| ( X1 != X2 ) )
& ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
= $true )
| ( X1 = X2 ) ) )
=> ( ( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
!= $true )
| ( sK2 != sK1 ) )
& ( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
= $true )
| ( sK2 = sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
? [X0: $tType,X1: X0,X2: X0] :
( ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
!= $true )
| ( X1 != X2 ) )
& ( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
= $true )
| ( X1 = X2 ) ) ),
inference(nnf_transformation,[],[f12]) ).
thf(f12,plain,
? [X0: $tType,X1: X0,X2: X0] :
( ( X1 = X2 )
<~> ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $tType,X1: X0,X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
= $true )
<=> ( X1 = X2 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X1: X0,X2: X0] :
( ( X1 = X2 )
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X1: X0,X2: X0] :
( ( X1 = X2 )
= ( 'const/sets/IN' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5NjRl2ZS1e/Vampire---4.8_23430','thm/sets/IN_SING_') ).
thf(f33,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f18,f30,f26]) ).
thf(f18,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
= $true )
| ( sK2 = sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEV446^1 : TPTP v8.1.2. Released v7.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:00:27 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH1_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.5NjRl2ZS1e/Vampire---4.8_23430
% 0.15/0.39 % (23687)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.39 % (23686)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (23683)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.39 % (23684)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.39 % (23685)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (23688)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.39 % (23682)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.39 % (23689)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.39 % Exception at run slice level
% 0.15/0.39 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.15/0.39 % (23685)Instruction limit reached!
% 0.15/0.39 % (23685)------------------------------
% 0.15/0.39 % (23685)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23685)Termination reason: Unknown
% 0.15/0.39 % (23685)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (23685)Memory used [KB]: 5373
% 0.15/0.39 % (23685)Time elapsed: 0.004 s
% 0.15/0.39 % (23685)Instructions burned: 2 (million)
% 0.15/0.39 % (23685)------------------------------
% 0.15/0.39 % (23685)------------------------------
% 0.15/0.39 % (23689)Instruction limit reached!
% 0.15/0.39 % (23689)------------------------------
% 0.15/0.39 % (23689)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23689)Termination reason: Unknown
% 0.15/0.39 % (23689)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (23689)Memory used [KB]: 5500
% 0.15/0.39 % (23689)Time elapsed: 0.005 s
% 0.15/0.39 % (23689)Instructions burned: 3 (million)
% 0.15/0.39 % (23689)------------------------------
% 0.15/0.39 % (23689)------------------------------
% 0.15/0.39 % (23687)First to succeed.
% 0.15/0.39 % (23683)Instruction limit reached!
% 0.15/0.39 % (23683)------------------------------
% 0.15/0.39 % (23683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23683)Termination reason: Unknown
% 0.15/0.39 % (23683)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (23683)Memory used [KB]: 5500
% 0.15/0.39 % (23683)Time elapsed: 0.005 s
% 0.15/0.39 % (23683)Instructions burned: 5 (million)
% 0.15/0.39 % (23683)------------------------------
% 0.15/0.39 % (23683)------------------------------
% 0.15/0.39 % (23684)Also succeeded, but the first one will report.
% 0.15/0.39 % (23687)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.39 % (23687)------------------------------
% 0.15/0.39 % (23687)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23687)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (23687)Memory used [KB]: 5500
% 0.15/0.39 % (23687)Time elapsed: 0.006 s
% 0.15/0.39 % (23687)Instructions burned: 3 (million)
% 0.15/0.39 % (23687)------------------------------
% 0.15/0.39 % (23687)------------------------------
% 0.15/0.39 % (23681)Success in time 0.008 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------